منابع مشابه
Community Size and Network Closure
Community size is often found to be negatively correlated with prosocial behaviors such as formal volunteering, working on public projects and informal help to friends and strangers (Putnam 2000, p. 119, 206). This may be because people who reside in large communities simply spend less time socializing with each other. As a result, people living in large cities have on average fewer friends, an...
متن کاملNetwork Evolution of Transactional Community: A Different Network Closure Mechanism from Social Network
With the Internet changing from era Web1.0 of computers’ interaction to era Web2.0 of users’ interaction, the development of transactional community has become the key solution to combine economic value with social value in social commerce. Transactional community is different from traditional social community in its relationship establishment because of the unique motivations of their members....
متن کاملlanguage learning strategies and vocabulary size of iranian efl learners
learning a second or foreign language requires the manipulation of four main skills, namely, listening, reading, speaking, and writing which lead to effective communication. it is obvious that vocabulary is an indispensible part of any communication, so without a vocabulary, no meaningful communication can take place and meaningful communication relies heavily on vocabulary. one fundamental fac...
Estimating the Size of the Transitive Closure
1 2 0 1 2 = 1 0 which completes the proof of the theorem. We immediate have the following corollary Corollary 1 For any integer d, and for all 0 < < 1=3, with probability of failure O(1=n d), the algorithm Estimating Reachability nds a 1 + approximation in O 1 (n + m) + ln(n) 2 1 (n + m) time. The proof follows directly from the theorem by setting = 1=n d. 3 Comments Note that if we set d = 2, ...
متن کاملSize-Estimation Framework with Applications to Transitive Closure and Reachability
Computing the transitive closure in directed graphs is a fundamental graph problem. We consider the more restricted problem of computing the number of nodes reachable from every node and the size of the transitive closure. The fastest known transitive closure algorithms run in O(min{mn, n2.38}) time, where n is the number of nodes and m the number of edges in the graph. We present an O(m) time ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: American Economic Review
سال: 2007
ISSN: 0002-8282
DOI: 10.1257/aer.97.2.80